Isomorphism of (mis)Labeled Graphs

On the Isomorphism Problem for Generalized Baumslag-solitar Groups

Generalized Baumslag–Solitar groups (GBS groups) are groups that act on trees with infinite cyclic edge and vertex stabilizers. Such an action is described by a labeled graph (essentially, the quotient graph of groups). This paper addresses the problem of determining whether two given labeled graphs define isomorphic groups; this is the isomorphism problem for GBS groups. There are two main res...

On Isomorphism of Simplicial Complexes and Their Related Algebras

General Graph Identification By Hashing

A method for identifying graphs using MD5 hashing is presented. This allows fast graph equality comparisons and can also be used to facilitate graph isomorphism testing. The graphs can be labeled or unlabeled. The method identifies vertices by hashing the graph configuration in their neighborhoods. With each vertex hashed, the entire graph can be identified by hashing the vertex hashes.

A General Framework for Mining Frequent Subgraphs from Labeled Graphs

The derivation of frequent subgraphs from a dataset of labeled graphs has high computational complexity because the hard problems of isomorphism and subgraph isomorphism have to be solved as part of this derivation. To deal with this computational complexity, all previous approaches have focused on one particular kind of graph. In this paper, we propose an approach to conduct a complete search ...

An Effective Approach for Solving Subgraph Isomorphism Problem

A novel and effective approach is presented in this paper for solving the wellknown difficult problem of subgraph isomorphism. By integrating planning strategies with the concept of centered spanning tree, the presented approach achieves an average-case, near-linear performance. A majority of practical subgraph isomorphism problems deals with the cases of labeled graphs, which contains the NPco...